|
A cellular automaton (CA) is (in the sense of being similar to Conway's Game of Life) if it meets the following criteria: * The array of cells of the automaton has two dimensions. * Each cell of the automaton has two states (conventionally referred to as "alive" and "dead", or alternatively "on" and "off") * The neighborhood of each cell is the Moore neighborhood; it consists of the eight adjacent cells to the one under consideration and (possibly) the cell itself. * In each time step of the automaton, the new state of a cell can be expressed as a function of the number of adjacent cells that are in the alive state and of the cell's own state; that is, the rule is ''outer totalistic'' (sometimes called ''semitotalistic''). This class of cellular automata is named for the Game of Life (B3/S23), the most famous cellular automaton, which meets all of these criteria. Many different terms are used to describe this class. It is common to refer to it as the "Life family" or to simply use phrases like "similar to Life". ==Notation for rules== There are three standard notations for describing these rules, that are similar to each other but incompatible. use the Wolfram code, a decimal number the binary representation of which has bits that correspond to each possible number of neighbors and state of a cell; the bits of this number are zero or one accordingly as a cell with that neighborhood is dead or alive in the next generation.〔 Reprinted in .〕 The other two notations unpack the same sequence of bits into a string of characters that is more easily read by a human. In the notation used by Mirek's Cellebration, a rule is written as a string x/y where each of x and y is a sequence of distinct digits from 0 to 8, in numerical order. The presence of a digit ''d'' in the x string means that a live cell with ''d'' live neighbors survives into the next generation of the pattern, and the presence of ''d'' in the y string means that a dead cell with ''d'' live neighbors becomes alive in the next generation. For instance, in this notation, Conway's Game of Life is denoted 23/3.〔.〕〔.〕 In the notation used by the Golly open-source cellular automaton package and in the RLE format for storing cellular automaton patterns, a rule is written in the form By/Sx where x and y are the same as in the MCell notation. Thus, in this notation, Conway's Game of Life is denoted B3/S23. The "B" in this format stands for "birth" and the "S" stands for "survival".〔 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Life-like cellular automaton」の詳細全文を読む スポンサード リンク
|